Approximation theory - PDFSEARCH.IO - Document Search Engine

Approximation theory
Results: 831

#	Item
621	Improved Approximation Lower Bounds for Vertex Cover on Power Law Graphs and Some Generalizations Mikael Gast∗ Mathias Hauptmann† Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2012-12-14 10:41:01 Applied mathematics Multigraph Independent set Dominating set Theoretical computer science NP-complete problems Mathematics
622	Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems Marek Karpinski∗ and Warren Schudy† Abstract Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2009-02-09 09:48:52 Group theory Linear algebra Vector space Bessel function Algebra Mathematics Fourier analysis
623	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-30 06:01:55 Algorithms Linear programming Randomized rounding Probabilistic complexity theory Linear programming relaxation Randomized algorithm Approximation algorithm David Shmoys Theoretical computer science Mathematics Applied mathematics
624	Quasi-Continuous Maximum Entropy Distribution Approximation with Kernel Density Add to Reading List Source URL: www.fernuni-hagen.de Language: English - Date: 2011-12-05 03:57:21 Non-parametric statistics Statistical theory Randomness Kernel density estimation Entropy Normal distribution Principle of maximum entropy Maximum entropy probability distribution Kernel Statistics Probability and statistics Information theory
625	HOW MANY ORDERS ARE THERE? MARTIN KOCHANSKI Abstract. The number of preferential arrangements of n labelled elements (also known as the ordered Bell numbers, and listed as sequence A000670 in Add to Reading List Source URL: www.nugae.com Language: English - Date: 2007-05-10 17:58:53 Constructible universe Bernoulli number Diophantine approximation Combinatorics Mathematics Number theory Integer sequences
626	A Robust PTAS for Machine Covering and Packing! Martin Skutella and Jos´e Verschae Institute of Mathematics, TU Berlin, Germany {skutella,verschae}@math.tu-berlin.de Abstract. Minimizing the makespan or maximizing the m Add to Reading List Source URL: page.math.tu-berlin.de Language: English Operations research Approximation algorithms Complexity classes Polynomial-time approximation scheme Job shop scheduling Bin packing problem Time complexity Linear programming David Shmoys Theoretical computer science Computational complexity theory Applied mathematics
627	Université de Bordeaux Faculté de Mathématiques ALGANT Master Mémoire de Master 2 Algebraic Values of Add to Reading List Source URL: www.algant.eu Language: English - Date: 2014-07-02 20:13:12 Transcendental numbers Diophantine approximation Transcendental function Algebraic independence Gelfond–Schneider theorem Field extension Vector space Schneider–Lang theorem Transcendence theory Algebra Mathematics Abstract algebra
628	RANK-TWO RELAXATION HEURISTICS FOR MAX-CUT AND OTHER BINARY QUADRATIC PROGRAMS∗ SAMUEL BURER† , RENATO D.C. MONTEIRO‡ , AND YIN ZHANG§ Abstract. The Goemans-Williamson randomized algorithm guarantees a high-qualit Add to Reading List Source URL: www.caam.rice.edu Language: English - Date: 2011-06-15 15:55:38 Operations research Mathematical optimization Combinatorial optimization Computational complexity theory Linear programming Semidefinite programming Maximum cut Approximation algorithm Cut Theoretical computer science Applied mathematics Mathematics
629	A Local Search Approximation Algorithm for k-Means Clustering∗ Tapas Kanungo† David M. Mount‡ Nathan S. Netanyahu§ Add to Reading List Source URL: www.kanungo.com Language: English - Date: 2006-09-07 03:00:00 Operations research Approximation algorithm Computational complexity theory Dynamic programming Algorithm K-means clustering Heuristic function Mathematics Applied mathematics Theoretical computer science
630	Ch 7 Approximation algorithms, online algorithms Bertrand Russell[removed]): Although this may seem a paradox, all exact science is dominated by the idea of approximation. 7.1 Minimum spanning tree approximation to the Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2005-04-08 10:39:43 NP-complete problems Operations research Spanning tree Travelling salesman problem Vertex cover Job shop scheduling Minimum spanning tree Matching Approximation algorithm Theoretical computer science Mathematics Computational complexity theory

UPDATE